Data storage based on rank modulation in single-level flash memory

ABSTRACT

Technologies are generally described to store data in single-level memory using rank modulation. In some examples, data to be encoded to single-level memory may be represented with a bit ranking for a group of bits. A program vector may then be determined from the bit ranking and partial program characteristics associated with the memory group(s). The memory group(s) may then be programmed according to the program vector. The encoded data may be subsequently retrieved by performing a series of partial programming operations on the memory group(s) to recover the bit ranking and derive the data represented.

CROSS-REFERENCE TO RELATED APPLICATION

The present application is a continuation application under 35 U.S.C.§120 of U.S. patent application Ser. No. 14/488,125, filed on Sep. 16,2014.

BACKGROUND

Unless otherwise indicated herein, the materials described in thissection are not prior art to the claims in this application and are notadmitted to be prior art by inclusion in this section.

Flash memory is a type of nonvolatile memory (NVM) that storesinformation in memory cells that include floating gate transistors.Flash memory may be single-level cell (SLC) or multi-level cell (MLC)devices. An SLC flash memory device may be configured to distinguishbetween two different charge levels on memory cells, thereby allowing anindividual memory cell to store a single bit of information. Incontrast, an MLC flash memory device may be configured to distinguishbetween four or more different charge levels on individual memory cells,thereby allowing an individual memory cell to store multiple bits ofinformation. However, SLC devices may have better data read and writeperformance than MLC devices due to having to distinguish between twodifferent charge levels, as compared to four or more different chargelevels.

SUMMARY

The present disclosure generally describes techniques to store data insingle-level memory using rank modulation.

According to some examples, methods to encode data on single-level flashmemory by use of rank modulation are described. An example method mayinclude determining a bit ranking within a group of bits based on thedata to be encoded; determining a plurality of partial programparameters for a plurality of flash memory bits, where each partialprogram parameter is associated with a respective bit in the pluralityof bits; determining a program vector based on the determined bitranking and the determined plurality of partial program parameters;and/or encoding the data to the plurality of bits using partialprogramming based on the determined program vector.

According to other examples, an apparatus may be configured to writedata in single-level flash memory by use of rank modulation. An exampleapparatus may include a processing block configured to determine a bitranking based on a data to be written; determine a plurality of completeprogram durations for a plurality of bits of a flash memory, where eachcomplete program duration indicates a respective program time durationto modify a respective bit in the plurality of bits from a first valueto a second value; and determine a program vector based on thedetermined bit ranking and the determined plurality of complete programdurations, the program vector being indicative of at least one partialprogram duration. The example apparatus may also include a memoryinterlace module coupled to the processing block. The memory interfacemodule may be configured to receive the determined program vector fromthe processing block; and write the data to the plurality of bits bypartial program of the plurality of bits according to the at least onepartial program duration indicated by the received program vector.

According to further examples, methods to retrieve data encoded insingle-level flash memory by use of rank modulation may be described. Anexample method may include performing a plurality of read operations ona plurality of bits of the flash memory, where each read operationincludes partially programming the plurality of bits based on at leastone partial program parameter; and reading a state of thepartially-programmed plurality of bits. The example method may alsoinclude determining a ranking associated with the plurality of bitsbased on at least the respective read states associated with theplurality of read operations and deriving a final data based on thedetermined ranking.

According to yet other examples, an apparatus may be configured toretrieve data encoded in single-level flush memory by use of rankmodulation. The apparatus may include a memory interface module coupledto a plurality of flash memory bits and a processing block coupled tothe memory interface module. The memory interface module may read aninitial state of the plurality of flash memory bits and perform aplurality of read operations on the plurality of bits by performance ofa partial program of the plurality of bits based on at least one partialprogram duration, where the at least one partial program durationindicates a program time to partially modify at least one bit in theplurality of bits from a first value to a second value, and performanceof a read of a state of the partially-programmed plurality of bits. Theprocessing block may receive, from the memory interface module, therespective read states associated with the plurality of read operations;determine a ranking associated with the plurality of bits based on therespective read states; and derive a final data based on the ranking.

The foregoing summary is illustrative only and is not intended to be inany way limiting. In addition to the illustrative aspects, embodiments,and features described above, further aspects, embodiments, and featureswill become apparent by reference to the drawings and the followingdetailed description.

BRIEF DESCRIPTION OF THE DRAWINGS

The foregoing and other features of this disclosure will become morefully apparent from the following description and appended claims, takenin conjunction with the accompanying drawings. Understanding that thesedrawings depict only several embodiments in accordance with thedisclosure and are, therefore, not to be considered limiting of itsscope, the disclosure will be described with additional specificity anddetail through use of the accompanying drawings, in which:

FIG. 1 illustrates an example memory device wherein data storage basedon rank modulation may be implemented;

FIG. 2 illustrates an example retrieving read process to recover datastored in single-level memory using rank modulation;

FIG. 3 illustrates an example of the programming process to writerank-modulated data into single-level memory;

FIG. 4 illustrates an example of the read-and-verify process to derive aprogram vector to write rank-modulated data into single-level memory;

FIG. 5 illustrates an example of the read-and-verify process to derive aprogram vector to write rank-modulated data into single-level memoryhaving bit-level erase capability;

FIG. 6 is a flowchart illustrating an example process to program and torecover rank-modulated data on single-level memory using partialprogramming;

FIG. 7 illustrates a general purpose computing device, which may be usedto provide data storage by use of rank modulation;

FIG. 8 is a flow diagram illustrating an example method to provide datastorage using rank modulation that may be performed by a computingdevice such as that in FIG. 7; and

FIG. 9 illustrates a block diagram of an example computer programproduct,

all arranged in accordance with at least some embodiments describedherein.

DETAILED DESCRIPTION

In the following detailed description, reference is made to theaccompanying drawings, which form a part hereof. In the drawings,similar symbols typically identify similar components, unless contextdictates otherwise. The illustrative embodiments described in thedetailed description, drawings, and claims are not meant to be limiting.Other embodiments may be utilized, and other changes may be made,without departing from the spirit or scope of the subject matterpresented herein. The aspects of the present disclosure, as generallydescribed herein, and illustrated in the Figures, can be arranged,substituted, combined, separated, and designed in a wide variety ofdifferent configurations, all of which are explicitly contemplatedherein.

This disclosure is generally drawn, inter alia, to methods, apparatus,systems, devices, and/or computer program products related to storingdata in single-level memory using rank modulation.

Briefly stated, technologies are generally described to store data insingle-level memory using rank modulation. In some examples, data to beencoded to single-level memory may be represented with a bit ranking fora group of bits. A program vector may then be determined from the bitranking and partial program characteristics associated with the memorygroup(s). The memory group(s) may then be programmed according to theprogram vector. The encoded data may be subsequently retrieved byperforming a series of partial programming operations on the memorygroup(s) to recover the bit ranking and derive the data represented.

FIG. 1 illustrates an example memory device wherein data storage basedon rank modulation may be implemented, arranged in accordance with atleast some embodiments described herein.

According to a diagram 100, an apparatus may include, for example, aprocessing block 101 and a memory device 102, which, in turn, mayinclude a memory controller 110 and memory cells 150. The processingblock 101 may execute instructions stored in the memory device 102and/or store data resulting from the operations in the memory device102. The memory controller 110 may include a memory interface module120, which, in turn, may include a write module 130 and a read module140. The memory controller 110, the memory interface module 120, and/orthe write module 130/read module 140 when present, may becommunicatively coupled to the memory cells 150 to read, write, oradjust stored data in the memory cells 150. The memory controller 110,the memory interface module 120, and/or the write module 130/read module140, may be implemented in hardware, software or other computer-readableinstructions stored on a computer-readable medium and executable by oneor more processors, or a combination thereof.

In some embodiments, the memory cells 150 may include flash memorycells, and may be implemented using floating-gate transistors. Thememory cells 150 may be implemented using single-level cell (SLC)technology or multi-level cell (MLC) technology. In either case, thememory interface module 120 and/or the write module 130 may beconfigured to write data to the memory cells 150 using one or more writepulses, which may store charge onto and thereby raise the voltage of thefloating gates associated with the memory cells.

In some embodiments, the change in threshold voltage of a memory cell asa function of the number of write pulses may be represented as:

ΔV _(th) =c·n

where n may be the number of write pulses and c may be a constantassociated with the memory cell. In general, different memory cells,even in the same memory, may have different voltage thresholds andcharging behavior due to manufacturing variations and dopantfluctuations in the cells. However, the equation above may still hold,with the possibility that different memory cells may be associated withdifferent values of c.

In some embodiments, a single write pulse may not store sufficientcharge at a memory cell to cause the threshold voltage of the memorycell to pass the next available voltage level, and multiple write pulsesmay be used in order to assure that the voltage of the memory cellpasses the voltage level. In such embodiments, a memory cell may beprogrammed using a number of write pulses less than that required forpassing the next voltage level. This is referred to as “partialprogramming” of the memory cell using a number of “partial programpulses”. As a result, the memory cell may then be in a “partiallyprogrammed” state.

In other embodiments, a write operation may involve using a total writetime duration of charge delivery in which a particular voltage isapplied instead of a number of write pulses. While in this disclosurepartial programming is described in the context of numbers of writepulses, partial programming may also be described in the context ofwrite time durations equivalent to one or more write pulses. Forexample, the value of a bit may be switched from “0” to “1” upon eitherthe application of a particular number of write pulses or theapplication of a write operation having a particular write timeduration.

In some embodiments, MLC memory may be configured with four or morecharge storage levels, allowing a single MLC bit to store multiple bitsof information. One technique that may be used to further increase datastorage capacity is rank modulation. In rank modulation, instead ofusing absolute charge levels on memory cells to store data, the relativeorder or rank of the charge levels on different cells may be used tostore data. MLC memory may be well suited to rank modulation, becauseMLC memory is often configured with multiple stable and consistentlevels across the entire memory, and the levels may allow thresholdvoltages of memory cells in a group to be ranked relatively simply. Incomparison, SLC memory may not have sufficiently tight parameter controlto enable more than two absolute levels across the entire memory.However, in some embodiments rank modulation may be implemented in SLCmemory using partial programming of memory cells as described above.

FIG. 2 illustrates an example retrieving read process to recover datastored in single-level memory using rank modulation, arranged inaccordance with at least some embodiments described herein.

According to a diagram 200, a retrieving read process 210 may beperformed by applying partial program pulses to a series of bits 201-208to retrieve rank-modulated data. At an initial readout operation 220, amemory controller (e.g., the memory controller 110) may read the valuesof the bits 201-208. As depicted in FIG. 2, the bits 201-205 and 207-208may initially have “0” values while the bit 206 may have a “1” value. Asa result, the bit 206 may be ranked first. At operation 230, the memorycontroller may partially program the bits 201-208 by applying a seriesof partial program pulses and then read the bits 201-208 again. Thememory controller may apply the partial program pulses at operation 230(and in subsequent operations) to all of the bits 201-208 or only to thebits with “0” values at the previous operation (e.g., bits 201-205 and207-208 for operation 230). Regardless, after the partial program pulsesare applied at operation 230, the bits 201-205 and 207 may remain at “0”while the bits 206 and 208 may be at “1”. Since the bit 206 waspreviously already “1” at operation 220 and therefore has the top rank,the bit 208 may now be ranked second.

At operation 232 the memory controller may again apply a series ofpartial program pulses and read the bits 201-208 to determine that whichbit 203 has changed from “0” to “1” and therefore may be ranked third.Similarly, at operations 234-242 the memory controller may continue toapply a series of partial program pulses and read the bits 201-208 todetermine that the bit sequence 205, 201, 202, 204, and 207 have changedvalues and therefore may be ranked fourth, fifth, sixth, seventh, andeighth, respectively. The final bit rank for the data written in thebits 201-208, represented as an ordered vector (206, 208, 203, 205, 201,202, 204, 207), may then be subsequently processed by the memorycontroller to recover the data encoded in rank modulation. After thelast bit to change value (the bit 207) has been read, the bits 201-208may be fully erased at operation 250 in preparation for subsequent dataencoding.

FIG. 3 illustrates an example programming process to writerank-modulated data into single-level memory, arranged in accordancewith at least some embodiments described herein.

According to a diagram 300, a program process 310 to writerank-modulated data to the bits 201-208 may be performed by a memorycontroller configured to apply partial program pulses to one or more ofthe bits 201-208. In the diagram 300, the program process 310 may beused to write the same rank-modulated data that was recovered in theretrieving read process 210 described in FIG. 2. As described above, theordered bit rank vector recovered in the retrieving read process 210 was(206, 208, 203, 205, 201, 202, 204, 207), where the first bit in thevector (the bit 206) reached a “1” value first and the last bit in thevector (the bit 207) reached a “1” value last. In order to prepare thebits 201-208 to change values as shown in the vector, each of the bits201-208 may be programmed using an appropriate number of partial programpulses. For example, assume that each of the bits 201-208 hassubstantially the same voltage level (as described above). In this cast,the bit 206, ranked first in the vector, may be programmed with the mostpartial program write pulses to bring the bit 206 closest (if not over)the level of “1”. The bit 208, ranked second in the vector, may then beprogrammed with fewer write pulses than the bit 206, and so on throughthe ranked bits, until the last-ranked bit 207, which may be programmedwith the fewest program pulses or even no program pulses at all.

In the diagram 300, a “1” value for a particular bit in a particularoperation may indicate that program pulses are applied to that bit inthat operation, whereas a “0” value may indicate that no program pulsesare applied to that bit in that operation. At operation 320, the memorycontroller may apply a number “2X” of program pulses to all of the bits201-208, as indicated by the “1” value for the bits 201-208. The “X” mayrepresent a particular incremental number of partial program pulses,which may be determined based on the program characteristics of the bits201-208. For example, the bits 201-208 may have different thresholdvoltages delineating the different possible stored bit values. As aresult, the number of program pulses to change the value of one bit maydiffer from the number of program pulses to change the value of anotherbit. This variation in numbers of partial program pulses may becharacterized using a mean α and a standard deviation Δ. In turn, theincremental number write pulses “X” may be determined based on the α andthe Δ. For example, “X” may be derived by dividing α+3Δ by the number ofbits used to store a particular rank-modulated data. In someembodiments, the value of “X” may be different for different bits, andthe memory controller may apply “X” write pulses to one bit and “X”program pulses to another bit, where the two “X” values differ.

At operation 330, the memory controller apply “X” program pulses to thebits 201-206 and 208, but not to the bit 207, as indicated by theassociated “0” value. As mentioned above, the bit 207 ranks last in theordered bit rank vector, and therefore may be programmed with the fewestprogram pulses. At operation 332, the memory controller may apply “X”program pulses to the bits 201-203, 205-206, and 208. At operation 334,the memory controller may apply “X” program pulses to the bits 201, 203,205-206, and 208. At operation 336, the memory controller may apply “X”program pulses to the bits 203, 205-206, and 208. At operation 338, thememory controller may apply “X” program pulses to the bits 203, 206, and208. At operation 340, the memory controller may apply “X” programpulses to the bits 206 and 208. At operation 342, the memory controllermay apply “X” program pulses to the bit 206, after which programming maybe considered complete for the data coded in rank modulation.

In some embodiments, the program process 310 may be described in thecontext of programming the bits 201-208 according to a program vector.The program vector may describe the number of program pulses to beapplied to each bit in 201-208 arranged according to bit rank. Forexample, the ordered bit rank vector provided above is (206, 208, 203,205, 201, 202, 204, 207). The corresponding program vector may be (206,208, 203, 205, 201, 202, 204, 207)=(“9X”, “8X”, “7X”, “6X”, “5X”, “4X”,“3X”, “2X”). The first number of write pulses (“9X”) may be the numberof program pulses to be applied to the first bit in the bit rank vector(the bit 206), the second number of program pulses (“8X”) may be thenumber of program pulses to be applied to the second bit (the bit 208),and so on. The program vector may also indicate a write time. An exampleof full program time in typical SLC may be 0.5 ms, which can be dividedinto 250 partial program pulses, each with a duration of 2 μs.

FIG. 4 illustrates an example read-and-verify process to derive aprogram vector to write rank-modulated data into SLC Flash, arranged inaccordance with at least some embodiments described herein.

According to a diagram 400, a memory controller may use aread-and-verify process 410 to read the data written into the bits201-208 and verify that the rank-modulated data represented by theprogram vector was correctly retrieved. The process 410 may use the sameprogram vector described above for ease of description, although ofcourse in other embodiments other program vectors may be read andverified.

At a first operation 420, the memory controller may read the values ofthe bits 201-208. As depicted in FIG. 4, the bits 201-205 and 207-208may initially have “0” values while the bit 206 may have a “1” value,which correctly corresponds to the bit rank vector. At operation 430 thememory controller may then apply “X” program pulses to the bits 201-205and 207-208 and subsequently may read the bits 201-208. Between normaloperations, having one and only one bit switch from “0” to “1” may beuseful. According to the program vector, after the program pulsesapplied in the operation 430, the bit 208 should switch from “0” to “1”.However, the bit 208 is shown as still reading “0”. This situation maybe referred to as a “delayed matriculation” error, in which a bit shouldhave switched values but did not. To correct this error, the memorycontroller may apply additional program pulses to the bit 208 atoperation 432, determine whether the additional program pulses causedthe bit 208 to switch, and continue applying additional program pulsesuntil the bit 208 switches from “0” to “1”. The memory controller mayalso apply the same number of additional program pulses to the bit 206in order to ensure that the bit 206 ranks over the bit 208.

After determining, the number of program pulses to correct the delayedmatriculation error, the memory controller may update the program vectorwith corrected program pulse numbers for the bit 208 and the bit 206.For example, if the memory controller applied an additional “X” programpulses to the bit 208 to cause the bit 208 to switch from “0” to “1”,the memory controller may adjust the program vector to (206, 208, 203,205, 201, 202, 204, 207)=(“10X”, “9X”, “7X”, “6X”, “5X”, “4X”, “3X”,“2X”), where “X” has been added to the program pulse numberscorresponding to the bits 206 and 208.

At operations 440 and 450, the memory controller may successively apply“X” program pulses to the remaining zero-value bits and subsequentlyread the bits 201-208 to determine whether the next ranked bits in theprogram vector (the bit 203 and the bit 205, respectively) switchedvalues from “0” to “1”. Upon determination that the bit 203 and the bit205 did successively switch values from “0” to “1”, the memorycontroller may again apply “X” program pulses to the remainingzero-value bits at operation 460 and subsequently read the bits 201-208.According to the program vector, the next ranked bit to switch valuesshould be the bit 202. However, both the bits 201 and 202 switchedvalues after the program pulse application in operation 460, where onlyone (the bit 201) bit should have switched. This situation may bereferred to as a “premature matriculation” error, in which a bit (thebit 202) switched values when the bit should not have switched values.To correct this error, the memory controller may reduce the number ofwrite pulses in the program vector associated with the bit 202. In orderto maintain the bit ranking, the memory controller may also reduce thenumber of program pulses associated with the bits ranked lower than thebit 202 (that is, the bits 204 and 207) accordingly. After thisreduction, the program vector may be (206, 208, 203, 205, 201, 202, 204,207)=(“10X”, “9X”, “7X”, “6X”, “5X”, “3X”, “2X”, “X”).

After the operation 460, the memory controller may again apply “X”program pulses to the remaining zero-value bits at operation 470 andsubsequently read the bits 201-208. The bit that should have switched atoperation 470 (the bit 202) already switched at operation 460 due to thepremature matriculation error, so the lack of switching at operation 470may not trigger a premature matriculation error. At next operation 480,the memory controller may again apply “X” write pulses to the remainingzero-value bits (the bits 204 and 207) and subsequently read the bits201-208. As with operation 460, a premature matriculation error mayoccur in the operation 480 as depicted, with the bit 207 switchingvalues when the bit 207 should not have switched values. Similar to theoperation 460, the memory controller may correct this error by reducingthe number of write pulses in the program vector associated with the bit207. Since the bit 207 is the last-ranked bit, no other program pulsereduction may be performed. Subsequently, the adjusted program vectormay be (206, 208, 203, 205, 201, 202, 204, 207)=(“10X”, “9X”, “7X”,“6X”, “5X”, “3X”, “2X”, “0”), and may be used to re-program the bits201-208 after full erasure.

The read-and-verify process 410 described above may be suitable for manyflash memory implementations in which bit-level partial erase isunavailable. However, some nonvolatile memory types, such as embeddedsingle-poly NVM, may have bit-level partial program and erasecapability, allowing enhanced read-and-verify processes. In someembodiments, such enhanced read-and-verify processes may have simplerand faster error handling and correction.

For example, in the read-and-verify process 410, the lowest number ofprogram pulses in the original program vector may determine the numberof premature matriculation errors that can be corrected without havingto restart the read-and-verify process with a different program vector.Specifically, since the original program vector was (206, 208, 203, 205,201, 202, 204, 207)=(“9X”, “8X”, “7X”, “6X”, “5X”, “4X”, “3X”, “2X”),the read-and-verify process 410 may only handle and correct twopremature matriculation errors, bringing the last number of write pulses(“2X”) to zero. Any additional premature matriculation errors mayinvolve the use of a new program vector that can handle more prematurematriculation errors, such as (206, 208, 203, 205, 201, 202, 204,207)=(“10X”, “9X”, “8X”, “7X”, “6X”, “5X”, “4X”, “3X”). In comparison,read-and-verify processes able to take advantage of bit-level eraseoperations may not need this consideration.

FIG. 5 illustrates an example read-and-verify process to derive aprogram vector to write rank-modulated data into single-level memoryhaving bit-level erase capability, arranged in accordance with at leastsome embodiments described herein.

According to a diagram 500, a memory controller may use aread-and-verify process 510 similar to the process 410 to read datawritten into the bits 201-208 and verify that rank-modulated datarepresented by a particular program vector was correctly written. Aswith the process 410, the process 510 may use the same program vectordescribed above for ease of description, although in other embodimentsother program vectors may be used.

Operations 520, 530, 532, 540, and 550 of the process 510 may be similarto the operations 420, 430, 432, 440, and 450 of the process 410,respectively. For example, the memory controller may initially read outdata in the operation 520 as in the operation 420 and may apply “X”program pulses to zero-value bits in the operations 530, 540, and 550 asin the operations 430, 440, and 450. The memory controller may correctdelay matriculation errors encountered in the operation 530 as in theoperation 430 via the application of additional program pulses andsubsequent correction of the program vector in the operation 532 asdescribed in the corresponding operation 432.

At an operation 560, the memory controller may detect a prematurematriculation error associated with the bit 202, as in the correspondingoperation 460. However, in addition to reducing the number of programpulses in the program vector associated with the bit 202 andlower-ranked bits (the bits 204 and 207), the memory controller may alsoapply one or more erase pulses to the bits 202, 204, and 207 in anoperation 562. In some embodiments, an erase pulse has the oppositefunctionality of a program pulse, and removes charge from the memorycell, thereby reducing the threshold voltage of the memory cell. Thememory controller may apply erase pulses to the bits 202, 204, and 207until bit 202 switches back to a “0” value. Subsequently, in anoperation 570, the memory controller may again apply “X” program pulsesto the remaining zero-value bits and subsequently read the bits 201-208,as in the operation 470. Unlike the operation 470, in the operation 570the bit 202 may be able to switch because of the erase pulses applied atthe operation 562. As a result, the memory controller may determinewhether the bit 202 actually does switch at the operation 570.

At next operation 580, the memory controller may again apply “X” programpulses to the remaining zero-value bits (the bits 204 and 207) similarto the operation 480. As with operation 560, a premature matriculationerror may occur in the operation 580 as depicted with the bit 207switching values when the bit 207 should not have switched values. Thememory controller may correct this error at operation 582 by reducingthe number of program pulses in the program vector associated with thebit 207 as well as applying sufficient erase pulses to the bit 207 untilthe bit 207 switches back to a “0” value, similar to the operation 562.

FIG. 6 is a flowchart illustrating an example process 600 to program andto recover rank-modulated data on single-level memory using partialprogramming, arranged in accordance with at least some embodimentsdescribed herein. Process 600 may include one or more operations,functions, or actions as illustrated by one or more of blocks 602-614.Although some of the blocks in process 600 (as well as in any otherprocess/method disclosed herein) are illustrated in a sequential order,these blocks may also be performed in parallel, and/or in a differentorder than those described herein. Also, the various blocks may becombined into fewer blocks, divided into additional blocks, and/oreliminated based upon the particular implementation. Additional blocksrepresenting other operations, functions, or actions may be provided.

According to process 600, rank-modulated data programming and recoverymay begin at block 602 (“Perform complete erase of page/block”), where amemory controller (for example, the memory controller 110) maycompletely erase a memory page, block, or section in preparation forwriting data. At block 604 (“Measure pulses to switch bits in page/blockto ‘1’”), which may follow block 602, the memory controller may measurethe number of program pulses and/or the program time duration to switchone or more of the bits in the memory page or block from a “0” value toa “1” value. In some embodiments, the memory controller and/or aprocessing block coupled to the memory controller may further derive oneor more partial program characteristics associated with the memory pageor block, such as the mean value of the number of program pulses α,standard deviation Δ, and/or an incremental number of program pulses “X”as described above. At block 606 (“Derive bit ranking from data to bewritten”), which may follow block 604, the memory controller and/or theprocessing block may determine a bit ranking from data to be written tothe memory using rank modulation techniques. At block 608 (“Deriveprogram vector for page/block using bit ranking to apply program pulseincrements and erase pulses if available”), which may follow block 606,the memory controller or the processing block may derive a programvector as described above based on the determined bit ranking andavailable memory operations such as the application of bit-level writeand/or erase pulses. In some embodiments, the program vector may beinitially derived and then verified using a program-and-verify processas described above in FIGS. 4-5. At block 610 (“Perform complete eraseof page/block and use derived program vector to program page/block”),which may follow block 608, the memory controller may again completelyerase the memory page or block and use the program vector derived inblock 608 to program the rank-modulated data to the memory page orblock.

At block 612 (“Perform multiple read operations to recover ranking bysequentially applying write pulses to bits and reading the resultingvalues”), which may follow block 610, the bit ranking associated withthe data written on the memory page/block may be recovered usingmultiple read operations. These read operations may be performed by thememory controller, and may involve the sequential application of programpulses to one or more bits in the memory and reading the resultingvalues, as described above in FIG. 2. At block 614 (“Recover data fromranking”), which may follow block 612, the memory controller and/or theprocessing block may then recover the rank-modulated data from therecovered bit ranking.

Other modifications may be made to the processes described above. Insome embodiments, a program vector may be determined using fewer programpulses per read operation. This reduction in the number of programpulses per operation may be equivalent to performing oversampling on thememory, and may result in better partial program resolution and reducedpremature matriculation rates, since an operation with fewer programpulses may be less likely to cause multiple bits to switch. Thereduction in the number of program pulses may be global (that is, forexample, implemented over the entire memory), local (that is, forexample, implemented over a portion of the memory), and/or adaptive (forexample, dynamically changing based on the data to be written and memoryconditions).

In further embodiments, the rank-modulated data program processes abovemay be used to provide security when transmitting data between twoentities. For example, a first entity may wish to send rank-modulateddata to a second entity. The first entity may derive a program vectorcorresponding to the rank-modulated data and divide the program vectorinto two (or more) portions. The first entity may then send a firstportion to the second entity via some means, program a memory using asecond portion of the program vector, and send the programmed memory tothe second entity. The second entity may then continue to program thememory using the received first portion and then recover therank-modulated data from the completely-programmed memory. In order tosuccessfully intercept the data, an attacker would have to acquire boththe first portion of the program vector and the programmed memory.

To further improve security and data reliability, a multi-bitrepresentation may be used for individual bits in rank-modulated data tobe written to memory. For example, two memory bits may be used torepresent a single data bit, with memory bit values of “01” and “10”corresponding to data bit values of “0” and “1”, respectively.

FIG. 7 illustrates a general purpose computing device, which may be usedto provide data storage by use of rank modulation, arranged inaccordance with at least some embodiments described herein.

For example, the computing device 700 may be used to program and recoverdata on single-level memory using partial programming as describedherein. In an example basic configuration 702, the computing device 700may include one or more processors 704 and a system memory 706. A memorybus 708 may be used to communicate between the processor 704 and thesystem memory 706. The basic configuration 702 is illustrated in FIG. 7by those components within the inner dashed line.

Depending on the desired configuration, the processor 704 may be of anytype, including but not limited to a microprocessor (μP), asmicrocontroller (μC), a digital signal processor (DSP), or anycombination thereof. The processor 704 may include one or more levels ofcaching, such as a level cache memory 712, a processor core 714, andregisters 716. The example processor core 714 may include an arithmeticlogic unit (ALU), a floating point unit (FPU), a digital signalprocessing core (DSP core), or any combination thereof. An examplememory controller 718, similar to the memory controller 110, may also beused with the processor 704, or in some implementations the memorycontroller 718 may be an internal part of the processor 704.Furthermore, the memory cells 150 of FIG. 1 may be implemented in one ormore of the cache memory 712, the system memory 706, and/or the storagedevices 732.

Depending on the desired configuration, the system memory 706 may be ofany type including but not limited to volatile memory (such as RAM),non-volatile memory (such as ROM, flash memory, etc.) or any combinationthereof. The system memory 706 may include an operating system 720, arank modulation module 722, and program data 724. The rank modulationmodule 722 may include a write module 726 and a read module 728 toimplement data storage using rank modulation as described herein. Thewrite module 726 and the read module 728 may be similar to the writemodule 130 and read module 140 of FIG. 1, respectively, except that inthe example embodiment of FIG. 7, the write module 726 and the readmodule 728 are implemented in a rank modulation module 722 stored in thesystem memory 706, rather than being sub-components of a memoryinterface module (or other module) in the memory controller 718. Theprogram data 724 may include, among other data, program vector data 730or the like, as described herein.

The computing device 700 may have additional features or functionality,and additional interfaces to facilitate communications between the basicconfiguration 702 and any desired devices and interfaces. For example, abus/interface controller 730 may be used to facilitate communicationsbetween the basic configuration 702 and one or more data storage devices732 via a storage interface bus 734. The data storage devices 732 may beone or more removable storage devices 736, one or more non-removablestorage devices 738, or a combination thereof. Examples of the removablestorage and the non-removable storage devices include magnetic diskdevices such as flexible disk drives and hard-disk drives (HDDs),optical disk drives such as compact disk (CD) drives or digitalversatile disk (DVD) drives, solid state drives (SSDs), and tape drivesto name a few. Example computer storage media may include volatile andnonvolatile, removable and non-removable media implemented in any methodor technology for storage of information, such as computer readableinstructions, data structures, program modules, or other data.

The system memory 706, the removable storage devices 736 and thenon-removable storage devices 738 are examples of computer storagemedia. Computer storage media includes, but is not limited to, RAM, ROM,EEPROM, flash memory or other memory technology, CD-ROM, digitalversatile disks (DVD), solid state drives, or other optical storage,magnetic cassettes, magnetic tape, magnetic disk storage or othermagnetic storage devices, or any other medium which may be used to storethe desired information and which may be accessed by the computingdevice 700. Any such computer storage media may be part of the computingdevice 700.

The computing device 700 may also include an interface bus 740 tofacilitate communication from various interface devices (e.g., one ormore output devices 742, one or more peripheral interfaces 750, and oneor more communication devices 760) to the basic configuration 702 viathe bus/interface controller 730. Some of the example output devices 742include a graphics processing unit 744 and an audio processing unit 746,which may be configured to communicate to various external devices suchas a display or speakers via one or more A/V ports 748. One or moreexample peripheral interfaces 750 may include a serial interfacecontroller 754 or a parallel interface controller 756, which may beconfigured to communicate with external devices such as input devices(e.g., keyboard, mouse, pen, voice input device, touch input device,etc.) or other peripheral devices (e.g., printer, scanner, etc.) via oneor more I/O ports 758. An example communication device 760 includes anetwork controller 766, which may be arranged to facilitatecommunications with one or more other computing devices 766 over anetwork communication link via one or more communication ports 764. Theone or more other computing devices 766 may include servers at adatacenter, customer equipment, and comparable devices.

The network communication link may be one example of a communicationmedia. Communication media may be embodied by computer readableinstructions, data structures, program modules, or other data in amodulated data signal, such as a carrier wave or other transportmechanism, and may include any information delivery media. A “modulateddata signal” may be a signal that has one or more of its characteristicsset or changed in such a manner as to encode information in the signal.By way of example, and not limitation, communication media may includewired media such as a wired network or direct-wired connection, andwireless media such as acoustic, radio frequency (RF), microwave,infrared (IR) and other wireless media. The term computer readable mediaas used herein may include both storage media and communication media.

The computing device 700 may be implemented as a part of a generalpurpose or specialized server, mainframe, or similar computer thatincludes any of the above functions. The computing device 700 may alsobe implemented as a personal computer including both laptop computer andnon-laptop computer configurations.

FIG. 8 is a flow diagram illustrating an example method to provide datastorage using rank modulation that may be performed by a computingdevice such as the computing device in FIG. 7, arranged in accordancewith at least some embodiments described herein.

Example methods may include one or more operations, functions or actionsas illustrated by one or more of blocks 822, 824, 826, and/or 828, andmay in some embodiments be performed by a computing device such as thecomputing device 800 in FIG. 8. The operations described in the blocks822-828 may also be performed in response to execution (by one or moreprocessors) of computer-executable instructions stored in acomputer-readable medium such as a non-transitory computer readablemedium 820 of a computing device 810, and executable by one or moreprocessors. In other embodiments, the various operations may beimplemented/provided using methods alternatively or in addition to theexecution of computer-executable instructions.

An example process to provide data storage using rank modulation maybegin with block 822, “MEASURE PARTIAL PROGRAM CHARACTERISTICS OF MEMORYPAGE/BLOCK”, where a memory controller (for example, the memorycontroller 110) may measure partial program characteristics of a memorypage or block onto which rank-modulated data is to be written, asdescribed above.

Block 822 may be followed by block 824, “DETERMINE PROGRAM VECTOR FORMEMORY PAGE/BLOCK USING PARTIAL PROGRAM CHARACTERISTICS AND BIT RANKINGCORRESPONDING TO INTENDED DATA”, where the memory controller or aprocessing block may determine a program vector representingrank-modulated data based on a bit ranking associated with the data andpartial program characteristics associated with the memory page/block,as described above. In some embodiments, the memory controller mayperform one or more read-and-verify processes as described above inFIGS. 4-5, and the processing block may further refine the programvector based on the read-and-verify results, as described above.

Block 824 may be followed by block 826, “WRITE MEMORY ACCORDING TODETERMINED PROGRAM VECTOR”, where the memory controller may write datato the memory by the application of program pulses according to thepreviously-determined program vector, as described above.

Block 826 may be followed by block 828, “PERFORM SERIES OF PARTIALPROGRAMMING ON BITS BASED ON PARTIAL PROGRAM CHARACTERISTICS TO RECOVERRANKING AND DERIVE INTENDED DATA”, where the memory controller mayrecover the rank-modulated data written to the memory page or block byperforming a series of partial programming on one or more bits in thememory page or block. For example, the memory controller maysequentially apply program pulses to one or more bits in the memory andread the resulting bit values to recover the bit ranking, as describedabove in FIG. 2. Once the bit ranking is recovered, the memorycontroller or the processing block may derive the intended data from therecovered bit ranking.

FIG. 9 illustrates a block diagram of an example computer programproduct, arranged in accordance with at least some embodiments describedherein.

In some examples, as shown in FIG. 9, a computer program product 900 mayinclude a signal bearing medium 902 that may also include one or moremachine readable instructions 904 that, in response to execution by, forexample, a processor may provide the functionality and featuresdescribed herein. Thus, for example, referring to the processor 704 inFIG. 7, the rank modulation module 722 may undertake one or more of thetasks shown in FIG. 9 in response to the instructions 904 conveyed tothe processor 704 by the signal bearing medium 902 to perform actionsassociated with data storage using rank modulation as described herein.Some of those instructions may include, for example, instructions tomeasure partial program characteristics of a memory page/block,determine a program vector for the memory page/block using the partialprogram characteristics and a bit ranking corresponding to intendeddata, program the memory according to the determined program vectorand/or perform a series of partial programming on bits based on thepartial program characteristics to recover the ranking and derive theintended data, according to some embodiments described herein.

In some implementations, the signal bearing medium 902 depicted in FIG.9 may encompass computer-readable medium 906, such as, but not limitedto, a hard disk drive (HDD), a solid state drive (SSD), a Compact Disc(CD), a Digital Versatile Disk (DVD), a digital tape, memory, etc. Insome implementations, the signal bearing medium 902 may encompassrecordable medium 908, such as, but not limited to, memory, read/write(R/W) CDs, R/W, DVDs, etc. In some implementations, the signal bearingmedia 902 may encompass communications media 910, such as, but notlimited to, a digital and/or an analog communication medium (e.g., afiber optic cable, a waveguide, a wired communication link, a wirelesscommunication link, etc.). Thus, for example, the computer programproduct 900 may be conveyed to one or more modules of the processor 704by an RF signal bearing medium, where the signal bearing medium 902 isconveyed by the wireless communications medium 910 (e.g., a wirelesscommunications medium conforming with the IEEE 802.11 standard).

According to some examples, methods to encode data on single-level flashmemory by use of rank modulation are described. An example method mayinclude determining a bit ranking within a group of bits based on thedata to be encoded; determining a plurality of partial programparameters for a plurality of flash memory bits, where each partialprogram parameter is associated with a respective bit in the pluralityof bits; determining a program vector based on the determined bitranking and the determined plurality of partial program parameters;and/or encoding the data to the plurality of bits using partialprogramming, based on the determined program vector.

According to other examples, determining the plurality of partialprogram parameters may include selecting the partial program parametersbased on one or more of a number of program pulses to modify therespective bit in the plurality of bits from a first value to a secondvalue and a program time to modify the respective bit in the pluralityof bits from the first value to the second value. The program vector mayindicate at least one program parameter including at least one of anumber of program pulses and a program time, and encoding the data mayinclude partially programming the plurality of bits by programmingaccording to the at least one program parameter to at least one bit inthe plurality of bits.

According to further examples, determining the program vector furthermay include reducing the at least one program parameter to performoversampling. The method may also include performing aprogram-and-verify sequence on the encoded data; adjusting thedetermined program vector based on the program-and-verify sequence; andre-encoding the data to the plurality of bits using partial programmingbased on the adjusted program vector. Performing the program-and-verifysequence may include performing at least one read operation on the dataencoded to the plurality of bits and determining, based on the at leastone read operation, whether at least one of delayed matriculation andpremature matriculation has occurred in association with at least onebit in the plurality of bits. Adjusting the determined program vectormay include adjusting a program parameter in the determined programvector associated with the at least one bit in response to determinationthat at least one of the delayed matriculation and the prematurematriculation has occurred.

According to yet other examples, adjusting the determined program vectormay further include adjusting another program parameter in the programvector associated with at least one other bit in the plurality of bits.Adjusting the program parameter may include one or more of: increasing anumber of program pulses to the at least one bit; increasing a programtime to the at least one bit; decreasing a number of program pulses tothe at least one bit; decreasing the program time to the at least onebit; and applying a number of erase pulses to the at least one bit.Determining the program vector may include determining a completeprogram vector based on the bit ranking and the plurality of partialprogram parameters dividing the complete program vector into a firstprogram vector portion and a second program vector portion; and encodingthe data based on the first program vector portion.

According to other examples, an apparatus may be configured to writedata in single-level flash memory by use of rank modulation. An exampleapparatus may include a processing block configured to determine a bitranking based on a data to be written; determine a plurality of completeprogram durations for a plurality of bits of a flash memory, where eachcomplete program duration indicates a respective program time durationto modify a respective bit in the plurality of bits from a first valueto a second value; and determine a program vector based on thedetermined bit ranking and the determined plurality of complete programdurations, the program vector being indicative of at least one partialprogram duration. The example apparatus may also include a memoryinterface module coupled to the processing block. The memory interfacemodule may be configured to receive the determined program vector fromthe processing block; and write the data to the plurality of bits bypartial program of the plurality of bits according to the at least onepartial program duration indicated by the received program vector.

According to some examples, each complete program duration may be basedon a number of program pulses corresponding to the respective programtime durations; and the at least one partial program duration mayinclude at least one of: a program time to at least partially modify atleast one bit in the plurality of bits from the first value to thesecond value; and a number of program pulses corresponding to theprogram time. The processing block may be further configured todetermine the program vector by reduction of at least one programparameter adaptively to perform oversampling.

According to yet other examples, the processing block may be furtherconfigured to control performance of a program-and-verify sequence onthe written data and adjust the determined program vector based on theprogram-and-verify sequence. The memory program module may be furtherconfigured to receive the adjusted program vector and rewrite the datato the plurality of bits by use of a partial program operation based onthe adjusted program vector. The processing block may also be configuredto control performance of the program-and-verify sequence by control ofperformance of at least one read operation on the data written to theplurality of bits and determination of, based on the at least one readoperation, whether at least one of delayed matriculation and prematurematriculation has occurred in association with at least one bit in theplurality of bits. The processing block may be further configured toadjust the determined program vector by at least one of adjustment ofthe at least one partial program duration in the determined programvector associated with the at least one bit in response to determinationthat at least one of the delayed matriculation and the prematurematriculation has occurred and adjustment of another partial programduration in the program vector associated with at least one other bit inthe plurality of bits.

According to further examples, methods to retrieve data encoded insingle-level flash memory by use of rank modulation may be described. Anexample method may include performing a plurality of read operations ona plurality of bits of the flash memory, where each read operationincludes partially programming the plurality of bits based on at leastone partial program parameter; and reading a state of thepartially-programmed plurality of bits. The example method may alsoinclude determining a ranking associated with the plurality of bitsbased on at least the respective read states associated with theplurality of read operations and deriving a final data based on thedetermined ranking.

According to yet further examples, the method may also include readingan initial state of the plurality of bits before performing theplurality of read operations, and where determining the rankingcomprises determining the ranking based on the initial state and therespective read states associated with the plurality of read operations.Determining the ranking may include determining the ranking based on atleast the respective read states associated with the plurality of readoperations and a multi-bit representation for at least one bit in thebit ranking.

According to yet other examples, an apparatus may be configured toretrieve data encoded in single-level flash memory by use of rankmodulation. The apparatus may include a memory interface module coupledto a plurality of flash memory bits and a processing block coupled tothe memory interface module. The memory interface module may read aninitial state of the plurality of flash memory bits and perform aplurality of read operations on the plurality of bits by performance ofa partial program of the plurality of bits based on at least one partialprogram duration, where the at least one partial program durationindicates a program time to partially modify at least one bit in theplurality of bits from a first value to a second value, and performanceof a read of a state of the partially-programmed plurality of bits. Theprocessing block may receive, from the memory interface module, therespective read states associated with the plurality of read operations;determine a ranking associated with the plurality of bits based on therespective read states; and derive a final data based on the ranking.

According to some examples, the at least one partial program durationmay be based on a number of program pulses corresponding to the programtime. The memory interface module may further perform the plurality ofread operations by reduction of the at least one partial programduration to perform oversampling.

Various embodiments may be implemented in hardware, software, orcombination of both hardware and software (or other computer-readableinstructions stored on a non-transitory computer-readable storage mediumand executable by one or more processors); the use of hardware orsoftware is generally (but not always, in that in certain contexts thechoice between hardware and software may become significant) a designchoice representing cost vs. efficiency tradeoffs. There are variousvehicles by which processes and/or systems and/or other technologiesdescribed herein may be effected (e.g., hardware, software, and/orfirmware), and the preferred vehicle will vary with the context in whichthe processes and/or systems and/or other technologies are deployed. Forexample, if an implementer determines that speed and accuracy areparamount, the implementer may opt for a mainly hardware and/or firmwarevehicle; if flexibility is paramount, the implementer may opt for amainly software implementation; or, yet again alternatively, theimplementer may opt for some combination of hardware, software, and/orfirmware.

The foregoing detailed description has set forth various embodiments ofthe devices and/or processes via the use of block diagrams, flowcharts,and/or examples. Insofar as such block diagrams, flowcharts, and/orexamples contain one or more functions and/or operations, each functionand/or operation within such block diagrams, flowcharts, or examples maybe implemented, individually and/or collectively, by a wide range ofhardware, software, firmware, or virtually any combination thereof. Inone embodiment, several portions of the subject matter described hereinmay be implemented via Application Specific Integrated Circuits (ASICs),Field Programmable Gate Arrays (FPGAs), digital signal processors(DSPs), or other integrated formats. However, some aspects of theembodiments disclosed herein, in whole or in part, may be equivalentlyimplemented in integrated circuits, as one or more computer programsexecuting on one or more computers (e.g., as one or more programsexecuting on one or more computer systems), as one or more programsexecuting on one or more processors (e.g., as one or more programsexecuting on one or more microprocessors), as firmware, or as virtuallyany combination thereof, and designing the circuitry and/or writing thecode for the software and/or firmware are possible in light of thisdisclosure.

The present disclosure is not to be limited in terms of the particularembodiments described in this application, which are intended asillustrations of various aspects. Many modifications and variations canbe made without departing from its spirit and scope. Functionallyequivalent methods and apparatuses within the scope of the disclosure,in addition to those enumerated herein, are possible from the foregoingdescriptions. Such modifications and variations are intended to fallwithin the scope of the appended claims. The present disclosure is to belimited only by the terms of the appended claims, along with the fullscope of equivalents to which such claims are entitled. Also, theterminology used herein is for the purpose of describing particularembodiments only, and is not intended to be limiting.

In addition, the mechanisms of the subject matter described herein arecapable of being distributed as a program product in a variety of forms,and that an illustrative embodiment of the subject matter describedherein applies regardless of the particular type of signal bearingmedium used to actually carry out the distribution. Examples of aasignal bearing medium include, but are not limited to, the following: arecordable type medium such as a floppy disk, a hard disk drive (HDD), aCompact Disc (CD), a Digital Versatile Disk (DVD), a digital tape, acomputer memory, a solid state drive, etc.; and a transmission typemedium such as a digital and/or an analog communication medium (e.g., afiber optic cable, a waveguide, a wired communication link, a wirelesscommunication link, etc.).

Those skilled in the art will recognize that it is common within the artto describe devices and/or processes in the fashion set forth herein,and thereafter use engineering practices to integrate such describeddevices and/or processes into data processing systems. That is, at leasta portion of the devices and/or processes described herein may beintegrated into a data processing system via a reasonable amount ofexperimentation. A data processing system may include one or more of asystem unit housing, a video display device, a memory such as volatileand non-volatile memory, processors such as microprocessors and digitalsignal processors, computational entities such as operating systems,drivers, graphical user interfaces, and applications programs, one ormore interaction devices, such as a touch pad or screen, and/or controlsystems including feedback loops and control motors (e.g., feedback forsensing position and/or velocity of gantry systems; control motors tomove and/or adjust components and/or quantities).

A data processing system may be implemented utilizing any suitablecommercially available components, such as those found in datacomputing/communication and/or network computing/communication systems.The herein described subject matter sometimes illustrates differentcomponents contained within, or connected with, different othercomponents. Such depicted architectures are merely exemplary, and infact, many other architectures may he implemented which achieve the samefunctionality. In a conceptual sense, any arrangement of components toachieve the same functionality is effectively “associated” such that thedesired functionality is achieved. Hence, any two components hereincombined to achieve a particular functionality may be seen as“associated with” each other such that the desired functionality isachieved, irrespective of architectures or intermediate components.Likewise, any two components so associated may also be viewed as being“operably connected”, or “operably coupled”, to each other to achievethe desired functionality, and any two components capable of being soassociated may also be viewed as being “operably couplable”, to eachother to achieve the desired functionality. Specific examples ofoperably couplable include but are not limited to physically connectableand/or physically interacting components and/or wirelessly interactableand/or wirelessly interacting components and/or logically interactingand/or logically interactable components.

With respect to the use of substantially any plural and/or singularterms herein, those having skill in the art can translate from theplural to the singular and/or from the singular to the plural as isappropriate to the context and/or application. The varioussingular/plural permutations may be expressly set forth herein for sakeof clarity.

It will be understood by those within the art that, in general, termsused herein, and especially in the appended claims (e.g., bodies of theappended claims) are generally intended as “open” terms (e.g., the term“including” should be interpreted as “including but not limited to,” theterm “having” should be interpreted as “having at least,” the term“includes” should be interpreted as “includes but is not limited to,”etc.). It will be further understood by those within the art that if aspecific number of an introduced claim recitation is intended, such anintent will he explicitly recited in the claim, and in the absence ofsuch recitation, no such intent is present. For example, as an aid tounderstanding, the following appended claims may contain usage of theintroductory phrases “at least one” and “one or more” to introduce claimrecitations. However, the use of such phrases should not be construed toimply that the introduction of a claim recitation by the indefinitearticles “a” or “an” limits any particular claim containing suchintroduced claim recitation to embodiments containing only one suchrecitation, even when the same claim includes the introductory phrases“one of ” or “at least one” and indefinite articles such as “a” or “an”(e.g., “a” and/or “an” should be interpreted to mean “at least one” or“one or more”); the same holds true for the use of definite articlesused to introduce claim recitations. In addition, even if a specificnumber of an introduced claim recitation is explicitly recited, thoseskilled in the art will recognize that such recitation should beinterpreted to mean at least the recited number (e.g., the barerecitation of “two recitations,” without other modifiers, means at leasttwo recitations, or two or more recitations).

Furthermore, in those instances where a convention analogous to “atleast one of A, B, and C, etc.” is used, in general such a constructionis intended in the sense one having skill in the art would understandthe convention (e.g., “a system having at least one of A, B, and C”would include but not be limited to systems that have A alone, B alone,C alone, A and B together, A and C together, B and C together, and/or A,B, and C together, etc.). It will be further understood by those withinthe art that virtually any disjunctive word and/or phrase presenting twoor more alternative terms, whether in the description, claims, ordrawings, should be understood to contemplate the possibilities ofincluding one of the terms, either of the terms, or both terms. Forexample, the phrase “A or B” will be understood to include thepossibilities of “A” or “B” or “A and B.”

As will be understood by one skilled in the art, for any and allpurposes, such as in terms of providing a written description, allranges disclosed herein also encompass any and all possible subrangesand combinations of subranges thereof. Any listed range can be easilyrecognized as sufficiently describing and enabling the same range beingbroken down into at least equal halves, thirds, quarters, fifths,tenths, etc. As a non-limiting example, each range discussed herein canbe readily broken down into a lower third, middle third and upper third,etc. As will also be understood by one skilled in the art all languagesuch as “up to,” “at least,” “greater than,” “less than,” and the likeinclude the number recited and refer to ranges which can be subsequentlybroken down into subranges as discussed above. Finally, as will beunderstood by one skilled in the art, a range includes each individualmember. Thus, for example, a group having 1-3 cells refers to groupshaving 1, 2, or 3 cells. Similarly, a group having 1-5 cells refers togroups having 1, 2, 3, 4, or 5 cells, and so forth.

While various aspects and embodiments have been disclosed herein, otheraspects and embodiments are possible. The various aspects andembodiments disclosed herein are for purposes of illustration and arenot intended to be limiting, with the true scope and spirit beingindicated by the following claims.

What is claimed is:
 1. A method to retrieve data from memory, the methodcomprising: iteratively applying a series of partial program pulses toeach memory cell of a plurality of memory cells; after the applicationof the series of partial program pulses, reading each memory cell of theplurality of memory cells; determining, based on the reading, a sequencein which each memory cell of the plurality of memory cells switches froma first value to a second value; determining, based on the sequence, arank vector; and retrieving data written in the plurality of memorycells by processing the rank vector.
 2. The method of claim 1, whereiniteratively applying the series of partial program pulses comprisesapplying the series of partial program pulses until each memory cell ofthe plurality of memory cells switches from the first value to thesecond value.
 3. The method of claim 1, wherein the plurality of memorycells are included in a single-level flash memory.
 4. The method ofclaim 1, wherein iteratively applying the series of partial programpulses comprises: applying the series of partial program pulses to atleast some memory cells of the plurality of memory cells that have thefirst value; and subsequently applying the series of partial programpulses to one or more memory cells, of the plurality of memory cells,wherein the one or more memory cells retain the first value afterapplication of the series of partial program pulses in a precedingoperation of applying.
 5. The method of claim 1, wherein reading eachmemory cell of the plurality of memory cells comprises reducing at leastone partial program duration to perform oversampling.
 6. The method ofclaim 1, wherein iteratively applying the series of partial programpulses comprises applying one or more partial program pulses that leadto switching of at least one memory cell, of the plurality of memorycells, from the first value to the second value.
 7. The method of claim1, further comprising: after the reading, determining an occurrence ofone of a premature matriculation error or a delayed matriculation error.8. The method of claim 7, further comprising: in response to thedetermination of the occurrence of one of the premature matriculationerror or the delayed matriculation error, updating a number of programpulses associated with switching of one or more memory cells, of theplurality of memory cells, from the first value to the second value,wherein the one or memory cells are associated with the prematurematriculation error or the delayed matriculation error.
 9. The method ofclaim 8, wherein updating the number of program pulses comprises one ormore of: increasing the number of program pulses to be applied to atleast one memory cell of the one or more memory cells; decreasing thenumber of program pulses associated with the at least one memory cell,of the one or more memory cells, in the rank vector; and applying one ormore erase pulses to the at least one memory cell of the one or morememory cells.
 10. The method of claim 7, further comprising: in responseto the determination of the occurrence of the premature matriculationerror or the delayed matriculation error, updating the rank vector. 11.The method of claim 10, further comprising retrieving the data writtenin the plurality of memory cells by processing the updated rank vector.12. A method to write data in memory, the method comprising: determininga rank vector for a plurality of memory cells; determining, based on therank vector, a respective number of partial program pulses to modifyeach memory cell, of the plurality of memory cells, from a first valueto a second value; and applying the respective number of partial programpulses to each memory cell of the plurality of memory cells, to encodedata by using rank modulation.
 13. The method of claim 12, wherein theplurality of memory cells are included in a single-level flash memory.14. The method of claim 12, wherein applying the respective number ofprogram pulses comprises applying a particular number of partial programpulses, resulting in a modification of a single memory cell, of theplurality of memory cells, from the first value to the second value. 15.The method of claim 12, wherein applying the respective number ofpartial program pulses to each memory cell comprises applying a mostnumber of partial program pulses to a memory cell ranked first in therank vector, and applying a least number of partial program pulses to amemory cell ranked last in the rank vector.
 16. The method of claim 12,wherein determining the rank vector includes receiving the rank vector.17. The method of claim 12, wherein the plurality of memory cells areincluded in a memory page or a memory block.
 18. The method of claim 17,wherein the method further comprises, prior to applying the respectivenumber of partial program pulses to each memory cell of the plurality ofmemory cells: measuring partial program characteristics of the memorypage or the memory block; and erasing the memory page or the memoryblock.
 19. An apparatus configured to retrieve data from memory, theapparatus comprising: read circuitry coupled to the memory andconfigured to read a respective initial state of each memory cell of aplurality of memory cells of the memory; program circuitry coupled tothe memory and configured to iteratively apply a series of partialprogram pulses to each memory cell of the plurality of memory cells,wherein application of the series of partial program pulses results in amodification of the respective initial state of at least one memory cellfrom a first value to second value, wherein after the application of theseries of partial program pulses, the read circuitry is configured toread a respective current state of each memory cell of the plurality ofmemory cells; and a controller coupled to the read circuitry and theprogram circuitry, and configured to: in response to a determinationthat the respective current state of each memory cell, of the pluralityof memory cells, corresponds to the second value, determine a rankingassociated with the plurality of memory cells; and derive data writtenin the plurality of memory cells based on the ranking, wherein thememory includes a single-level flash memory, and wherein the pluralityof memory cells are included in a memory page of the single-level flashmemory or a memory block of the single-level flash memory.
 20. Anapparatus configured to write data in memory, the apparatus comprising:a controller configured to: determine a rank vector for a plurality ofmemory cells of the memory; and determine, based on the rank vector, arespective number of partial program pulses to modify each memory cell,of the plurality of memory cells, from a first value to a second value;and program circuitry coupled to the controller and configured to applythe respective number of partial program pulses to each memory cell, ofthe plurality of memory cells, wherein the application of a particularnumber of partial program pulses results in a modification of a singlememory cell, of the plurality of memory cells, from the first value tothe second value, and wherein the memory includes a single-level flashmemory, and wherein the plurality of memory cells are included in amemory page of the single-level flash memory or a memory block of thesingle-level flash memory.